code word length造句

For this reason, Shannon Fano is almost never used; Huffman coding is almost as computationally simple and produces prefix codes that always achieve the lowest expected code word length, under the constraints that each symbol is represented by a code formed of an integral number of bits.
The Huffman coding algorithm takes as input the frequencies that the code words should have, and constructs a prefix code that minimizes the weighted average of the code word lengths . ( This is closely related to minimizing the entropy . ) This is a form of lossless data compression based on entropy encoding.
It's difficult to find code word length in a sentence. 用code word length造句挺难的